Regular semitopological groups of every countable sequential order

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on extremally disconnected semitopological groups

Answering recent question of A.V. Arhangel’skii we construct in ZFC an extremally disconnected semitopological group with continuous inverse having no open Abelian subgroups.

متن کامل

Groups with regular automorphisms of order four

An automorphism of a group G is called regular if it moves every element of G except the identity. BURNSIDE proved that a finite group G has a regular automorphism of order two if and only if G is an abelian group of odd order, and then the only such automorphism maps every element onto its inverse ([21, p. 230). More recently several authors considered the question: what groups can admit regul...

متن کامل

Countable Primitive Groups

We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a special case Kleinian groups as well as subgroups of word hyperbolic groups. As an application we calculate the Frattini subgroup in many of these settings, oft...

متن کامل

Automorphism groups of countable structures

Suppose M is a countable first-order structure with a ‘rich’ automorphism group Aut(M). We will study Aut(M) both as a group and as a topological group, where the topology is that of pointwise convergence. This involves a mixture of model theory, group theory, combinatorics, descriptive set theory and topological dynamics. Here, ‘rich’ is undefined and depends on the context, but examples which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 1994

ISSN: 0166-8641

DOI: 10.1016/0166-8641(94)90127-9